NP-Hardness of Cache Mapping
نویسندگان
چکیده
Plncessors sllch os the Iritel StrorigARM SA-1110 orid tlir Intel XScole provide ,fle.riDI~. contrnl oller tlie corhe riinnogen7ent to orhieve better roche z~tili:oriori. Pl-ogronis can specih tlie cache ~iinpying policy for each virtr~ol poge, i.e. niopping it to the mnirz cache, the riiini-coche, or neithel: For the latter cose, the pnge is mnrked ns nonr~cheoble. 111 tliis popel; we liiodel the rnche maypirzg pl-oDle117 orid p r o ~ ~ e [hat firiding the optiriial cnche mopping is NP-hord.
منابع مشابه
Streaming cache placement problems: complexity and algorithms
Virtual private networks are often used to distribute live content, such as video or audio streams, to a potentially large number of destinations. Streaming caches (also called splitters) are deployed in these multicast systems to allow content distribution without overloading the network. In this paper, we consider two related combinatorial optimization problems that arise in multicast network...
متن کاملThe Competence of Sub-Optimal Theories of STructure Mapping on Hard Analogies
Structure-mapping is a provably NP-Hard problem which is argued to lie at the core of the human metaphoric and analogical reasoning faculties. This NP-Hardness has meant that earlier naïve attempts at optimal solutions to the problem have had to be augmented with sub-optimal heuristics to ensure tractable performance. This paper considers various epistemological grounds for qualifying the compe...
متن کاملCache-and-Relay Streaming Media Delivery for Asynchronous Clients
We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully di...
متن کاملNP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants
Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): the problem of finding a mapping of a request graph (describing a workload) onto a substrate graph (describing the physical infrastructure). Applications range from mapping testbeds (from where the problem originated), over the embedding of batch-processing workloads (virtual clu...
متن کاملA Learning-based Approach to Joint Content Caching and Recommendation at Base Stations
Recommendation system is able to shape user demands, which can be used for boosting caching gain. In this paper, we jointly optimize content caching and recommendation at base stations. We first propose a model to capture the impact of recommendation on user demands, which is controlled by a user-specific threshold. We then formulate a joint caching and recommendation problem maximizing the cac...
متن کامل